Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("WINOGRAD S")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 35

  • Page / 2
Export

Selection :

  • and

ON MULTIPLICATION OF POLYNOMIALS MODULO A POLYNOMIALWINOGRAD S.1980; S.I.A.M. J. COMPUTG.; USA; DA. 1980; VOL. 9; NO 2; PP. 225-229; BIBL. 5 REF.Article

COMPLEXITY OF COMPUTATIONSWINOGRAD S.1978; ACM 78. ASSOCIATION FOR COMPUTING MACHINERY. ANNUAL CONFERENCE/1978-12-4/WASHINGTON DC; USA; NEW YORK: THE ASSOCIATION FOR COMPUTING MACHINERY; DA. 1978; PP. 138-141; BIBL. 22 REF.Conference Paper

A NEW ALGORITHM FOR COMPUTING THE DISCRETE FOURIER TRANSFORM.WINOGRAD S.1977; IN: ANNU ASILOMAR CONF. CIRCUITS, SYST., COMPUT. 10; PACIFIC GROVE, CALIF.; 1976; NORTH HOLLYWOOD, CALIF.; WESTERN PERIODICALS; DA. 1977; PP. 1-3; BIBL. 2 REF.Conference Paper

A NEW METHOD FOR COMPUTING DFT.WINOGRAD S.1977; IN: INT. CONF. ACOUST. SPEECH SIGNAL PROCESS.; HARTFORD, CONN.; 1977; NEW YORK; INST. ELECTR. ELECTRON. ENG.; DA. 1977; PP. 366-368; BIBL. 4 REF.Conference Paper

ON COMPUTING THE DISCRETE FOURIER TRANSFORMATION.WINOGRAD S.1976; PROC. NATION. ACAD. SCI. U.S.A.; U.S.A.; DA. 1976; VOL. 73; NO 4; PP. 1005-1006; BIBL. 2 REF.Article

THE EFFECT OF THE FIELD OF CONSTANTS ON THE NUMBER OF MULTIPLICATIONS.WINOGRAD S.1975; IN: ANNU. SYMP. FOUND. COMPUT. SCI. 16; BERKELEY, CALIF.; 1975; NEW YORK; INST. ELECTR. ELECTRON. ENG.; DA. 1975; PP. 1-2; BIBL. 3 REF.Conference Paper

ON MULTIPLICATION IN ALGEBRAIC EXTENSION FIELDSWINOGRAD S.1979; J. THEOR. COMPUTER SCI.; NLD; DA. 1979; VOL. 8; NO 3; PP. 359-377; BIBL. 4 REF.Article

ON COMPUTING THE DISCRETE FOURIER TRANSFORM.WINOGRAD S.1978; MATH. OF COMPUT.; U.S.A.; DA. 1978; VOL. 32; NO 141; PP. 175-199; BIBL. 6 REF.Article

ON THE PARALLEL EVALUATION OF CERTAIN ARITHMETIC EXPRESSIONS.WINOGRAD S.1975; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1975; VOL. 22; NO 4; PP. 477-492; BIBL. 13 REF.Article

SOME BILINEAR FORMS WHOSE MULTIPLICATIVE COMPLEXITY DEPENDS ON THE FIELD OF CONSTANTS.WINOGRAD S.1976; MATH. SYST. THEORY; U.S.A.; DA. 1976-1977; VOL. 10; NO 2; PP. 169-180; BIBL. 6 REF.Article

ON THE ASYMPTOTIC COMPLEXITY OF MATRIX MULTIPLICATIONCOPPERSMITH D; WINOGRAD S.1981; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 22/1981/NASHVILLE TN; USA; NEW YORK: INSTITUTE OF ELECTRICAL & ELECTRONICS ENGINEERS; DA. 1981; PP. 82-90; BIBL. 12 REF.Conference Paper

A NEW APPROACH TO ERROR-CORRECTING CODES.LEMPEL A; WINOGRAD S.1977; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1977; VOL. 23; NO 4; PP. 503-508; BIBL. 9 REF.Article

FINDING ALL SHORTEST DISTANCES IN A DIRECTED NETWORKHOFFMAN AJ; WINOGRAD S.1972; I.B.M. J. RES. DEVELOP.; U.S.A.; DA. 1972; VOL. 16; NO 4; PP. 412-414; BIBL. 4 REF.Serial Issue

TDM-FDM CONVERSION REQUIRING REDUCED COMPUTATION COMPLEXITYPELED A; WINOGRAD S.1978; I.E.E.E. TRANS. COMMUNIC.; USA; DA. 1978; VOL. 26; NO 5; PP. 707-719; BIBL. 7 REF.Article

ON THE DIRECT SUM CONJECTUREFEIG E; WINOGRAD S.1981; ANNUAL SYMPOSIUM ON FUNDATIONS OF COMPUTER SCIENCE. 22/1981/NASHVILLE TN; USA; NEW YORK: INSTITUTE OF ELECTRICAL & ELECTRONICS ENGINEERS; DA. 1981; PP. 91-94; BIBL. 9 REF.Conference Paper

ON THE ASYMPTOTIC COMPLEXITY OF MATRIX MULTIPLICATIONCOPPERSMITH D; WINOGRAD S.1982; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1982; VOL. 11; NO 3; PP. 472-492; BIBL. 12 REF.Article

ON THE COMPLEXITY OF MULTIPLICATION IN FINITE FIELDSLEMPEL A; SEROUSSI G; WINOGRAD S et al.1983; THEORETICAL COMPUTER SCIENCES; ISSN 0304-3975; NLD; DA. 1983; VOL. 22; NO 3; PP. 285-296; BIBL. 8 REF.Article

DIRECT SUMS OF BILINEAR ALGORITHMSAVSLANDER L; FEIG E; WINOGRAD S et al.1981; LINEAR ALGEBRA & APPL.; ISSN 0024-3795; USA; DA. 1981; VOL. 38; PP. 175-192; BIBL. 7 REF.Article

OPTIMAL ITERATIVE PROCESSES FOR ROOT-FINDINGBRENT R; WINOGRAD S; WOLFE P et al.1973; NUMER. MATH.; DTSCH.; DA. 1973; VOL. 20; NO 5; PP. 327-341; BIBL. 6 REF.Serial Issue

Matrix multiplication via arithmetic progressionsCOPPERSMITH, D; WINOGRAD, S.Journal of symbolic computation. 1990, Vol 9, Num 3, pp 251-280, issn 0747-7171, 30 p.Article

On the multiplicative complexity of discrete cosine transformsFEIG, E; WINOGRAD, S.IEEE transactions on information theory. 1992, Vol 38, Num 4, pp 1387-1391, issn 0018-9448Article

Fast algorithms for the discrete cosine transformFEIG, E; WINOGRAD, S.IEEE Transactions on signal processing. 1992, Vol 40, Num 9, pp 2174-2193Article

Computing the ambiguity surfaceTOLIMIERI, R; WINOGRAD, S.IEEE transactions on acoustics, speech, and signal processing. 1985, Vol 33, Num 5, pp 1239-1245, issn 0096-3518Article

On the direct sum conjectureFEIG, E; WINOGRAD, S.Linear algebra and its applications. 1984, Vol 63, Num 12, pp 193-219, issn 0024-3795Article

A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channelsGREENBERG, A. G; WINOGRAD, S.Journal of the Association for Computing Machinery. 1985, Vol 32, Num 3, pp 589-596, issn 0004-5411Article

  • Page / 2